Some optimal binary and ternary t-EC-AUED codes
نویسندگان
چکیده
This paper is devoted to the non-symmetric channels. Here we will present t-EC-AUED codes. Böinck and van Tilborg gave a bound on the length of binary t-EC-AUED codes. A generalization of this bound to arbitrary alphabet size is given. This generalized Böinck van Tilborg bound, combined with constructions, is used to determine the length of some optimal binary and ternary t-EC-AUED codes. The size of optimal 0-EC-AUED codes is the numver of vectors of length n and weight dn(q − 1)/2e. So we will make computations for t > 0, but for completeness, we give also the codes for t = 0.
منابع مشابه
Some Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملt-Error Correcting/ d-Error Detecting (d>t) and All Unidirectional Error Detecting Codes with Neural Network (Part II)
In this paper, we develop an algorithm for t-error correcting/d-error detecting and all unidirectional error detecting (t-EC/d-ED/AUED) codes in the framework of neural work. As t-EC/d-ED/AUED codewords are formed by concatenation of information bits and one or more groups of check bits depending on how we want to construct code, we demonstrate neural network algorithms for constructing, detect...
متن کاملNew Tec - : hniqtws for
We present; t,wo new t.~·r·ln!iqnr:-s for con~l.rnct.ing 1.EC/AUED codes. The cnmbiu~t.ion 'lf the l.wn L<'c!tniqnf"s rednce!l the t,otal rednnda.nry of t,h,. hr:-st r·nnsl.rll(~tions hy on" hit. or 11101'<' in 111<1.ny c<J.SPS.
متن کاملSome new lower bounds for ternary covering codes
In [5], we studied binary codes with covering radius one via their characteristic functions. This gave us an easy way of obtaining congruence properties and of deriving interesting linear inequalities. In this paper we extend this approach to ternary covering codes. We improve on lower bounds for ternary 1-covering codes, the so-called football pool problem, when 3 does not divide n − 1. We als...
متن کاملEC/AUED Codes
A common method of constructing single error correcting/all unidirectional error detecting (SEC/AUED) codes is to choose a SEC code and then to append a tail such that the new code can detect all unidirectional errors. The tail is a function of the weight of the codeword. We present a technique to reduce the weight distribution of the SEC code so that the tail needed is smaller. We also present...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 55 شماره
صفحات -
تاریخ انتشار 2009